منابع مشابه
A Polynomial with Galois Group SL2(11)
We compute a polynomial with Galois group SL 2 (11) over Q.Furthermorewe prove that SL 2 (11) is the Galois group of a regular extension of Q(t).
متن کاملA polynomial with Galois group SL2(F16)
In this paper we show that the polynomial x − 5x +12x − 28x +72x − 132x + 116x − 74x + 90x − 28x − 12x + 24x − 12x − 4x − 3x − 1 ∈ Q[x] has Galois group SL2(F16), filling in a gap in the tables of Jürgen Klüners and Gunther Malle (see [12]). The computation of this polynomial uses modular forms and their Galois representations.
متن کاملComputing the Galois group of a polynomial
This article outlines techniques for computing the Galois group of a polynomial over the rationals, an important operation in computational algebraic number theory. In particular, the linear resolvent polynomial method of [6] will be described.
متن کاملA Testing Nilpotence of Galois Groups in Polynomial Time
We give the first polynomial-time algorithm for checking whether the Galois group Gal (f) of an input polynomial f(X) ∈ Q[X] is nilpotent: the running time of our algorithm is bounded by a polynomial in the size of the coefficients of f and the degree of f . Additionally, we give a deterministic polynomial-time algorithm that, when given as input a polynomial f(X) ∈ Q[X] with nilpotent Galois g...
متن کاملRings with a setwise polynomial-like condition
Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.2000.0380